Minimal linear codes from weakly regular plateaued balanced functions

Minimal linear codes have diverse applications in many areas such as secret sharing schemes and secure two-party computation. There are several construction methods for these codes, one of which is based on functions over finite fields. In this paper, to construct minimal with few weights, we make use weakly regular plateaued balanced Fp, where p an odd prime, the second generic method. We obtain three-weight four-weight desirable parameters from functions. The weight distributions obtained completely determined help Walsh then derive projective punctured some by deleting coordinates defining sets. It worth noting that they may include (almost) optimal codes. finally analyze minimum Hamming distances dual our association schemes.